Flexible kernels for RBF networks

نویسندگان

  • André O. Falcão
  • Thibault Langlois
  • Andreas Wichert
چکیده

In this paper we propose a novel approach for modeling kernels in Radial Basis Function networks. The method provides an extra degree of flexibility to the kernel structure. This flexibility comes through the use of modifier functions applied to the distance computation procedure, essential for all kernel evaluations. Initially the classifier uses an unsupervised method to construct the network topology, where most parameters of the network are defined without any customization from the user. During the second phase only one parameter per kernel is estimated. Experimental evidence on four datasets shows that the algorithm is robust and competitive. r 2006 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extreme Learning Machine with Randomly Assigned RBF Kernels

A new learning algorithm called extreme learning machine (ELM) has recently been proposed for single-hidden layer feedforward neural networks (SLFNs) with additive neurons to easily achieve good generalization performance at extremely fast learning speed. ELM randomly chooses the input weights and analytically determines the output weights of SLFNs. It is proved in theory that ELM can be extend...

متن کامل

Evolving Hyperparameters of Support Vector Machines Based on Multi-Scale RBF Kernels

Kernel functions are used in support vector machines (SVMs) to compute dot product in a higher dimensional space. The performance of classification depends on the chosen kernel. Each kernel function is suitable for some tasks. In order to obtain a more flexible kernel function, a family of RBF kernels is proposed. Multi-scale RBF kernels are combined by including weights. These kernels allow be...

متن کامل

Approximation Networks Based on Shape-adaptive Kernels Using Localized Threshold Decomposition

Approximation networks combined with learning algorithms are being increasingly used to represent or approximate unknown mappings of multivariate functionals. Potential functions in general, and the subclass of radial basis functions (RBF), are examples of this approach where combinations of localized kernels are used to t the relatively sparse available observations. The kernels describe the l...

متن کامل

Generalized RBF feature maps for Efficient Detection

These kernels combine the benefits of two other important classes of kernels: the homogeneous additive kernels (e.g. the χ2 kernel) and the RBF kernels (e.g. the exponential kernel). However, large scale problems require machine learning techniques of at most linear complexity and these are usually limited to linear kernels. Recently, Maji and Berg [2] and Vedaldi and Zisserman [4] proposed exp...

متن کامل

Multivariable Approximation by Convolutional Kernel Networks

Computational units induced by convolutional kernels together with biologically inspired perceptrons belong to the most widespread types of units used in neurocomputing. Radial convolutional kernels with varying widths form RBF (radial-basis-function) networks and these kernels with fixed widths are used in the SVM (support vector machine) algorithm. We investigate suitability of various convol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neurocomputing

دوره 69  شماره 

صفحات  -

تاریخ انتشار 2006